Post-Quantum Two-Party Adaptor Signature Based on Coding Theory

نویسندگان

چکیده

An adaptor signature can be viewed as a concealed with secret value and, by design, any two of the trio yield other. In multiparty setting, an initial allows each party to create additional signatures without original secret. Adaptor help address scalability and interoperability issues in blockchain. They also bring some important advantages cryptocurrencies, such low on-chain cost, improved transaction fungibility, fewer limitations blockchain’s scripting language. this paper, we propose new two-party scheme that relies on quantum-safe hard problems coding theory. The proposed uses hash-and-sign code-based introduced Debris-Alazard et al. relation defined from well-known syndrome decoding problem. To achieve all basic properties formalized Aumayr al., introduce further modifications aforementioned scheme. We give security analysis our its application atomic swap. After providing set parameters for scheme, show it has smallest pre-signature size compared existing post-quantum signatures.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multi-Signature Scheme based on Coding Theory

In this paper we propose two first non-generic constructions of multisignature scheme based on coding theory. The first system make use of the CFS signature scheme and is secure in random oracle while the second scheme is based on the KKS construction and is a few times. The security of our construction relies on a difficult problems in coding theory: The Syndrome Decoding problem which has bee...

متن کامل

A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies

We present the first general-purpose digital signature scheme based on supersingular elliptic curve isogenies secure against quantum adversaries in the quantum random oracle model with small key sizes. This scheme is an application of Unruh’s construction of non-interactive zero-knowledge proofs to an interactive zero-knowledge proof proposed by De Feo, Jao, and Plût. We implement our proposed ...

متن کامل

A post-quantum proxy signature scheme based on rainbow digital signature

Quantum computers have recently emerged as a threat to the traditional public key cryptosystems based on the difficult problems of integer factoring, discrete logarithm, and elliptic curve, such as RSA, DSA, ElGamal, and ECC. The proxy signature schemes based on these cryptosystems have been threatened at the same time. So it is important to propose efficient and secure proxy signature schemes ...

متن کامل

Susceptible Two-Party Quantum Computations

In secure two-party function evaluation Alice holding initially a secret input x and Bob having a secret input y communicate to determine a prescribed function f(x, y) in such a way that after the computation Bob learns f(x, y) but nothing more about x other than he could deduce from y and f(x, y) alone, and Alice learns nothing. Unconditionally secure function evaluation is known to be essenti...

متن کامل

Multi-Party Concurrent Signature Scheme Based on Designated Verifiers

Fair exchange signature is of importance in the field of the open-network-based security applications. A new multi-party concurrent signature (MPCS) scheme based on designated verifiers is introduced, which features fairness and unforgeability based on the hardness of the Computational Diffie-Hellman (CDH) assumption in the random oracle model. In this scheme, each signer has the right to choos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cryptography

سال: 2022

ISSN: ['2410-387X']

DOI: https://doi.org/10.3390/cryptography6010006